github.com/andybalholm/brotli/matchfinder.absoluteMatch.End (field)

43 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		emitter.go#L11: 	End int
		emitter.go#L30: 		Length:    m.End - m.Start,
		emitter.go#L33: 	e.NextEmit = m.End
		m4.go#L60: 	return (m.End-m.Start)*256 + (bits.LeadingZeros32(uint32(m.Start-m.Match))-32)*q.DistanceBitCost
		m4.go#L112: 		if matches[0] != (absoluteMatch{}) && i >= matches[0].End {
		m4.go#L116: 				if matches[1].End > matches[0].Start {
		m4.go#L117: 					matches[1].End = matches[0].Start
		m4.go#L119: 				if matches[1].End-matches[1].Start >= q.MinLength && q.score(matches[1]) > 0 {
		m4.go#L133: 				if m.End-m.Start >= q.MinLength {
		m4.go#L148: 		if i < matches[0].End && i != matches[0].End+2-q.HashLen {
		m4.go#L160: 			if m.End-m.Start > q.MinLength && q.score(m) > 0 {
		m4.go#L176: 				if m.End-m.Start > q.MinLength && q.score(m) > q.score(currentMatch) {
		m4.go#L182: 		if currentMatch.End-currentMatch.Start < q.MinLength {
		m4.go#L189: 			if currentMatch.Start <= matches[1].End {
		m4.go#L212: 		case matches[0].Start < matches[2].End:
		m4.go#L220: 		case matches[0].Start < matches[2].End+q.MinLength:
		m4.go#L232: 			if matches[2].End > matches[1].Start {
		m4.go#L233: 				matches[2].End = matches[1].Start
		m4.go#L234: 				if q.ChainLength > 0 && matches[2].End-matches[2].Start >= q.MinLength {
		m4.go#L247: 						if bytes.Equal(src[matches[2].Start:matches[2].End], src[pos:pos+matches[2].End-matches[2].Start]) {
		m4.go#L254: 			if matches[2].End-matches[2].Start >= q.MinLength && q.score(matches[2]) > 0 {
		m4.go#L263: 		if matches[1].End > matches[0].Start {
		m4.go#L264: 			matches[1].End = matches[0].Start
		m4.go#L266: 		if matches[1].End-matches[1].Start >= q.MinLength && q.score(matches[1]) > 0 {
		m4.go#L335: 		End:   end,
		pathfinder.go#L156: 		if i >= prevMatch.End && prevMatch != (absoluteMatch{}) {
		pathfinder.go#L161: 				if m.End-m.Start > q.MinLength {
		pathfinder.go#L170: 			if m.End-m.Start > q.MinLength {
		pathfinder.go#L187: 				if m.End-m.Start > q.MinLength && m.End-m.Start > currentMatch.End-currentMatch.Start {
		pathfinder.go#L194: 		if i < prevMatch.End && currentMatch.End-currentMatch.Start <= prevMatch.End-prevMatch.Start {
		pathfinder.go#L198: 			i = prevMatch.End
		pathfinder.go#L210: 		i = currentMatch.End + 2 - q.HashLen
		pathfinder.go#L246: 			if m.End > pending.End {
		pathfinder.go#L253: 			for j := m.Start + q.MinLength; j <= m.End; j++ {
		pathfinder.go#L273: 		if unmatched == 0 && pending.Start != i && pending.End >= i+q.MinLength &&
		pathfinder.go#L276: 			for j := i + q.MinLength; j <= pending.End; j++ {